Exponential convergence of distributed primal–dual convex optimization algorithm without strong convexity

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Convergence of Variance-Reduced Stochastic Gradient without Strong Convexity

Stochastic gradient algorithms estimate the gradient based on only one or a fewsamples and enjoy low computational cost per iteration. They have been widelyused in large-scale optimization problems. However, stochastic gradient algo-rithms are usually slow to converge and achieve sub-linear convergence rates,due to the inherent variance in the gradient computation. To accelerate...

متن کامل

Linear Convergence of the Primal-Dual Gradient Method for Convex-Concave Saddle Point Problems without Strong Convexity

We consider the convex-concave saddle point problem minx maxy f(x) + y>Ax− g(y) where f is smooth and convex and g is smooth and strongly convex. We prove that if the coupling matrix A has full column rank, the vanilla primaldual gradient method can achieve linear convergence even if f is not strongly convex. Our result generalizes previous work which either requires f and g to be quadratic fun...

متن کامل

Convergence of the Min-Sum Algorithm for Convex Optimization

We establish that the min-sum message-passing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems.

متن کامل

Iteration Complexity Analysis of Multi-block ADMM for a Family of Convex Minimization Without Strong Convexity

The alternating direction method of multipliers (ADMM) is widely used in solving structuredconvex optimization problems due to its superior practical performance. On the theoretical sidehowever, a counterexample was shown in [7] indicating that the multi-block ADMM for minimizingthe sum of N (N ≥ 3) convex functions with N block variables linked by linear constraints maydive...

متن کامل

Fuzzy convexity and multiobjective convex optimization problems

K e y w o r d s F u z z y convexity; Fuzzy criterion sets, Pareto-optimal decision, Multiple objective optimization. 1. I N T R O D U C T I O N Since most of practical decision problems are fuzzy and approximate, fuzzy decision making becomes one of the most impor tan t practical approaches. However, the result ing problems are frequently complicated and difficult to solve. One effective way to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2019

ISSN: 0005-1098

DOI: 10.1016/j.automatica.2019.04.004